Efficient Heuristic Based Methods for Two-Stage Transshipment Problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A two Stage Heuristic Solution Approach for Resource Assignment during a Cell Formation Problem

Design of Cellular Manufacturing System involves four major decisions: Cell formation (CF), Group layout (GL), Group scheduling (Gs) and Resource assignment (RA).  These problems should be regarded, concurrently, in order to obtain an optimal solution in a CM environment. In this paper a two stage heuristic procedure is proposed for CF and RA decisions problem. The solution approach contains a ...

متن کامل

Optimal and heuristic algorithms for the multi-location dynamic transshipment problem with fixed transshipment costs

We consider centrally controlled multi-location systems, which coordinate their replenishment strategies through the use of transshipments. In a dynamic deterministic demand environment the problem is characterized by several locations, each of which has known demand for a single product for each period in a given finite horizon. We consider replenishment, transshipment and inventory holding co...

متن کامل

Some efficient heuristic methods for the flow shop sequencing problem

We compare in this paper the best heuristic methods known up to now to solve the flow shop sequencing problem and we improve the complexity of the best one. Next, we apply to this problem taboo search, a new technique to solve combinatorial optimization problems, and we report computational experiments. Finally a parallel taboo search algorithm is presented and experimental results show that th...

متن کامل

Two new heuristic algorithms for Covering Tour Problem

Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...

متن کامل

Two Strategies Based on Meta-Heuristic Algorithms for Parallel Row Ordering Problem (PROP)

Proper arrangement of facility layout is a key issue in management that influences efficiency and the profitability of the manufacturing systems. Parallel Row Ordering Problem (PROP) is a special case of facility layout problem and consists of looking for the best location of n facilities while similar facilities (facilities which has some characteristics in common) should be arranged in a row ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Operations Research

سال: 2018

ISSN: 2160-8830,2160-8849

DOI: 10.4236/ajor.2018.84016